Classification of regular two-graphs on 36 and 38 vertices

In a previous paper an incomplete investigation into regular two-graphs on 36 vertices established the existence of at least 227. Using a more efficient algorithm, the two authors have independently verified that in fact these 227 comprise the complete set. An immediate consequence of this is that all strongly regular graphs with parameters (35,16,6,8), (36,14,4,6), (36,20,10,12) and their complements are now known. Similar techniques were attempted in the case of regular two-graphs on 38 vertices, but without success on account of the vast amount of computer time required. Instead a different approach was used which managed to increase the known number of such regular two-graphs from 11 to 19l.